The strong decidability of cut logics. II. Generalizations.
نویسندگان
چکیده
منابع مشابه
Approximating generalizations of Max Cut
This thesis is written for the Swedish degree Licentiate of Science, teknisk licentiat. It is a university degree, intermediate between that of master and that of doctor. We study the approximability of different generalizations of the Max Cut problem. First, we show that Max Set Splitting and Max Not-All-Equal Sat are both approximable within 1.380 in probabilistic polynomial time. The algorit...
متن کاملBisimulation Quantified Modal Logics: Decidability
Bisimulation quantifiers are a natural extension of modal logics. They preserve the bisimulation invariance of modal logic, while allowing monadic second-order expressivity. Unfortunately, it is not the case that extension by bisimulation quantifiers always preserves the decidability of a modal logic. Here we examine a general class of modal logics for which decidability is preserved under exte...
متن کاملDecidability for Justification Logics Revisited
Justification logics are propositional modal-like logics that instead of statements A is known include statements of the form A is known for reason t where the term t can represent an informal justification for A or a formal proof of A. In our present work, we introduce model-theoretic tools, namely: filtrations and a certain form of generated submodels, in the context of justification logic in...
متن کاملDecidability of Propositionally Quantified Logics of Knowledge
Logics of knowledge have important applications for reasoning about security protocols and multi-agent systems. We extend the semantics for the logic of necessity with local propositional quantification L ( ,∃,∃1,...∃k) introduced in [4] to allow reasoning about knowledge in more general (non-hierarchical) systems. We show that these new semantics preserve the properties of knowledge in a multi...
متن کاملDecidability of Circumscribed Description Logics Revisited
We revisit non-monotonic description logics based on circumscription (with preferences) and prove several decidability results for their satisfiability problem. In particular, we consider circumscribed description logics without the finite model property (DL-LiteF andALCFI) and with fixed roles (DL-LiteF and a fragment of DL-LiteR), improving upon previous decidability results that are limited ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1971
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093894363